Proof Spaces for Unbounded Parallelism
نویسندگان
چکیده
منابع مشابه
Duet: Static Analysis for Unbounded Parallelism
Duet is a static analysis tool for concurrent programs in which the number of executing threads is not statically bounded. Duet has a modular architecture, which is based on separating the invariant synthesis problem in two subtasks: (1) data dependence analysis, which is used to construct a data flow model of the program, and (2) interpretation of the data flow model over a (possibly infinite)...
متن کاملVerification of Software Components: Addressing Unbounded Parallelism
To use verification tools for reliability analysis of a software component, it is desirable to specify the behavior of the component by a finite-state model. This is often impossible at design time if the component practices unbounded parallelism. In that case, the behavior of the component widely depends on the environment the component is instantiated in. Unfortunately, covering all possible ...
متن کاملModeling Unbounded Parallelism Using Behavior Protocols
To use model checking for reliability analysis of a software component, it is desirable to specify the behavior of the component by a finite-state model. This is often impossible at design time if the component features unbounded parallelism. In that case, the behavior of the component widely depends on the environment the component is instantiated in. Unfortunately, covering all possible envir...
متن کاملSupporting unbounded process parallelism in the SPC programming model
In automatic mapping of parallel programs to target parallel machines the eeciency of the compile-time cost estimation needed to steer the optimization process is highly dependent on the choice of programming model. Recently a new parallel programming model, called SPC, has been introduced that speciically aims at the eecient computation of reliable cost estimates, paving the way for automatic ...
متن کاملUnbounded and Bounded Parallelism in Bmf. Case-study: Rank Sorting
BMF is a formalism that allows us to design parallel programs independently of the target architecture, and to transform the programs into more efficient programs using equational reasoning. We show in this paper that even the abstractness of BMF is very high, bounded and unbounded parallelism can be expressed in this model, and also that BMF allows us to transform a program into different vari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2015
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2775051.2677012